0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.13	% Command    : run_E %s %d THM
0.13/0.34	% Computer : n020.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 960
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Tue Aug  9 06:54:35 EDT 2022
0.13/0.34	% CPUTime    : 
0.20/0.47	Running higher-order on 8 cores theorem proving
0.20/0.47	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.20/0.47	# Version: 3.0pre003-ho
0.20/0.48	# Preprocessing class: HSSSSMSSSSSNSSA.
0.20/0.48	# Scheduled 8 strats onto 8 cores with 120 seconds (960 total)
0.20/0.48	# Starting post_as_ho12 with 120s (1) cores
0.20/0.48	# Starting new_bool_9 with 120s (1) cores
0.20/0.48	# Starting post_as_ho1 with 120s (1) cores
0.20/0.48	# Starting post_as_ho4 with 120s (1) cores
0.20/0.48	# Starting post_as_ho2 with 120s (1) cores
0.20/0.48	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.20/0.48	# Starting full_lambda_10 with 120s (1) cores
0.20/0.48	# Starting new_ho_8 with 120s (1) cores
0.20/0.48	# new_ho_8 with pid 31451 completed with status 0
0.20/0.48	# Result found by new_ho_8
0.20/0.48	# Preprocessing class: HSSSSMSSSSSNSSA.
0.20/0.48	# Scheduled 8 strats onto 8 cores with 120 seconds (960 total)
0.20/0.48	# Starting post_as_ho12 with 120s (1) cores
0.20/0.48	# Starting new_bool_9 with 120s (1) cores
0.20/0.48	# Starting post_as_ho1 with 120s (1) cores
0.20/0.48	# Starting post_as_ho4 with 120s (1) cores
0.20/0.48	# Starting post_as_ho2 with 120s (1) cores
0.20/0.48	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.20/0.48	# Starting full_lambda_10 with 120s (1) cores
0.20/0.48	# Starting new_ho_8 with 120s (1) cores
0.20/0.48	# SinE strategy is GSinE(CountTerms,hypos,10,,2,20000,1.0,true)
0.20/0.48	# ...ProofStateSinE()=1/2
0.20/0.48	# Search class: HUUPF-FFSF11-SSSFFFBN
0.20/0.48	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.20/0.48	# Starting post_as_ho10 with 65s (1) cores
0.20/0.48	# post_as_ho10 with pid 31453 completed with status 0
0.20/0.48	# Result found by post_as_ho10
0.20/0.48	# Preprocessing class: HSSSSMSSSSSNSSA.
0.20/0.48	# Scheduled 8 strats onto 8 cores with 120 seconds (960 total)
0.20/0.48	# Starting post_as_ho12 with 120s (1) cores
0.20/0.48	# Starting new_bool_9 with 120s (1) cores
0.20/0.48	# Starting post_as_ho1 with 120s (1) cores
0.20/0.48	# Starting post_as_ho4 with 120s (1) cores
0.20/0.48	# Starting post_as_ho2 with 120s (1) cores
0.20/0.48	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.20/0.48	# Starting full_lambda_10 with 120s (1) cores
0.20/0.48	# Starting new_ho_8 with 120s (1) cores
0.20/0.48	# SinE strategy is GSinE(CountTerms,hypos,10,,2,20000,1.0,true)
0.20/0.48	# ...ProofStateSinE()=1/2
0.20/0.48	# Search class: HUUPF-FFSF11-SSSFFFBN
0.20/0.48	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.20/0.48	# Starting post_as_ho10 with 65s (1) cores
0.20/0.48	# Preprocessing time       : 0.001 s
0.20/0.48	# Presaturation interreduction done
0.20/0.48	
0.20/0.48	# Proof found!
0.20/0.48	# SZS status Theorem
0.20/0.48	# SZS output start CNFRefutation
0.20/0.48	thf(decl_22, type, epred1_0: a > a > $o).
0.20/0.48	thf(decl_23, type, esk1_1: (a > $o) > a).
0.20/0.48	thf(cCT31, conjecture, ~(?[X1:a > a > $o]:(![X2:a > $o]:(?[X3:a]:((((X1 @ X3)=(X2))<=>((X2)=(X2))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cCT31)).
0.20/0.48	thf(c_0_1, negated_conjecture, ~(~(?[X1:a > a > $o]:(![X2:a > $o]:(?[X3:a]:((((X1 @ X3)=(X2))<=>((X2)=(X2)))))))), inference(assume_negation,[status(cth)],[cCT31])).
0.20/0.48	thf(c_0_2, negated_conjecture, ![X8:a > $o]:(((((epred1_0 @ (esk1_1 @ X8))!=(X8))|((X8)=(X8)))&(((X8)!=(X8))|((epred1_0 @ (esk1_1 @ X8))=(X8))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])).
0.20/0.48	thf(c_0_3, negated_conjecture, ![X2:a > $o]:((((epred1_0 @ (esk1_1 @ X2))=(X2))|((X2)!=(X2)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.48	thf(c_0_4, negated_conjecture, ![X2:a > $o]:(((epred1_0 @ (esk1_1 @ X2))=(X2))), inference(cn,[status(thm)],[c_0_3])).
0.20/0.48	thf(c_0_5, negated_conjecture, ![X2:a > $o, X10:a]:(((epred1_0 @ (esk1_1 @ X2) @ X10)<=>(X2 @ X10))), inference(arg_cong,[status(thm)],[c_0_4])).
0.20/0.48	thf(c_0_6, negated_conjecture, ![X2:a > $o, X3:a]:(((epred1_0 @ (esk1_1 @ X2) @ X3)|~((X2 @ X3)))), inference(dynamic cnf,[status(thm)],[c_0_5])).
0.20/0.48	thf(c_0_7, negated_conjecture, ![X2:a > $o, X3:a]:(((epred1_0 @ (esk1_1 @ (^[Z0:a]:(~((X2 @ Z0))))) @ X3)|(X2 @ X3))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]), c_0_6])).
0.20/0.48	thf(c_0_8, negated_conjecture, ![X2:a > $o, X3:a]:(((X2 @ X3)|~((epred1_0 @ (esk1_1 @ X2) @ X3)))), inference(dynamic cnf,[status(thm)],[c_0_5])).
0.20/0.48	thf(c_0_9, negated_conjecture, (epred1_0 @ (esk1_1 @ (^[Z0:a]:(~((epred1_0 @ Z0 @ Z0))))) @ (esk1_1 @ (^[Z0:a]:(~((epred1_0 @ Z0 @ Z0)))))), inference(ef,[status(thm)],[c_0_7])).
0.20/0.48	thf(c_0_10, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9])]), c_0_9])]), ['proof']).
0.20/0.48	# SZS output end CNFRefutation
0.20/0.48	# Parsed axioms                        : 2
0.20/0.48	# Removed by relevancy pruning/SinE    : 1
0.20/0.48	# Initial clauses                      : 2
0.20/0.48	# Removed in clause preprocessing      : 1
0.20/0.48	# Initial clauses in saturation        : 1
0.20/0.48	# Processed clauses                    : 17
0.20/0.48	# ...of these trivial                  : 2
0.20/0.48	# ...subsumed                          : 3
0.20/0.48	# ...remaining for further processing  : 12
0.20/0.48	# Other redundant clauses eliminated   : 0
0.20/0.48	# Clauses deleted for lack of memory   : 0
0.20/0.48	# Backward-subsumed                    : 0
0.20/0.48	# Backward-rewritten                   : 0
0.20/0.48	# Generated clauses                    : 33
0.20/0.48	# ...of the previous two non-redundant : 24
0.20/0.48	# ...aggressively subsumed             : 0
0.20/0.48	# Contextual simplify-reflections      : 0
0.20/0.48	# Paramodulations                      : 15
0.20/0.48	# Factorizations                       : 2
0.20/0.48	# NegExts                              : 0
0.20/0.48	# Equation resolutions                 : 1
0.20/0.48	# Propositional unsat checks           : 0
0.20/0.48	#    Propositional check models        : 0
0.20/0.48	#    Propositional check unsatisfiable : 0
0.20/0.48	#    Propositional clauses             : 0
0.20/0.48	#    Propositional clauses after purity: 0
0.20/0.48	#    Propositional unsat core size     : 0
0.20/0.48	#    Propositional preprocessing time  : 0.000
0.20/0.48	#    Propositional encoding time       : 0.000
0.20/0.48	#    Propositional solver time         : 0.000
0.20/0.48	#    Success case prop preproc time    : 0.000
0.20/0.48	#    Success case prop encoding time   : 0.000
0.20/0.48	#    Success case prop solver time     : 0.000
0.20/0.48	# Current number of processed clauses  : 10
0.20/0.48	#    Positive orientable unit clauses  : 5
0.20/0.48	#    Positive unorientable unit clauses: 0
0.20/0.48	#    Negative unit clauses             : 1
0.20/0.48	#    Non-unit-clauses                  : 4
0.20/0.48	# Current number of unprocessed clauses: 8
0.20/0.48	# ...number of literals in the above   : 13
0.20/0.48	# Current number of archived formulas  : 0
0.20/0.48	# Current number of archived clauses   : 2
0.20/0.48	# Clause-clause subsumption calls (NU) : 10
0.20/0.48	# Rec. Clause-clause subsumption calls : 10
0.20/0.48	# Non-unit clause-clause subsumptions  : 2
0.20/0.48	# Unit Clause-clause subsumption calls : 3
0.20/0.48	# Rewrite failures with RHS unbound    : 0
0.20/0.48	# BW rewrite match attempts            : 4
0.20/0.48	# BW rewrite match successes           : 0
0.20/0.48	# Condensation attempts                : 0
0.20/0.48	# Condensation successes               : 0
0.20/0.48	# Termbank termtop insertions          : 1504
0.20/0.48	
0.20/0.48	# -------------------------------------------------
0.20/0.48	# User time                : 0.004 s
0.20/0.48	# System time              : 0.000 s
0.20/0.48	# Total time               : 0.004 s
0.20/0.48	# Maximum resident set size: 1788 pages
0.20/0.48	
0.20/0.48	# -------------------------------------------------
0.20/0.48	# User time                : 0.004 s
0.20/0.48	# System time              : 0.003 s
0.20/0.48	# Total time               : 0.007 s
0.20/0.48	# Maximum resident set size: 1720 pages
0.20/0.48	EOF